TSTP Solution File: QUA006^1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : QUA006^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:31:29 EDT 2023

% Result   : Theorem 36.82s 37.09s
% Output   : Proof 36.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : QUA006^1 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.15  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n012.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Sat Aug 26 16:39:25 EDT 2023
% 0.21/0.36  % CPUTime    : 
% 0.21/0.50  %----Proving TH0
% 0.21/0.51  %------------------------------------------------------------------------------
% 0.21/0.51  % File     : QUA006^1 : TPTP v8.1.2. Released v4.1.0.
% 0.21/0.51  % Domain   : Quantales
% 0.21/0.51  % Problem  : Zero is left-annihilator
% 0.21/0.51  % Version  : [Hoe09] axioms.
% 0.21/0.51  % English  :
% 0.21/0.51  
% 0.21/0.51  % Refs     : [Con71] Conway (1971), Regular Algebra and Finite Machines
% 0.21/0.51  %          : [Hoe09] Hoefner (2009), Email to Geoff Sutcliffe
% 0.21/0.51  % Source   : [Hoe09]
% 0.21/0.51  % Names    : QUA06 [Hoe09] 
% 0.21/0.51  
% 0.21/0.51  % Status   : Theorem
% 0.21/0.51  % Rating   : 0.31 v8.1.0, 0.36 v7.5.0, 0.29 v7.4.0, 0.44 v7.2.0, 0.38 v7.1.0, 0.50 v7.0.0, 0.43 v6.4.0, 0.50 v6.3.0, 0.40 v6.2.0, 0.57 v6.1.0, 0.43 v6.0.0, 0.57 v5.5.0, 0.83 v5.4.0, 1.00 v4.1.0
% 0.21/0.51  % Syntax   : Number of formulae    :   27 (  14 unt;  12 typ;   7 def)
% 0.21/0.51  %            Number of atoms       :   42 (  18 equ;   0 cnn)
% 0.21/0.51  %            Maximal formula atoms :    2 (   2 avg)
% 0.21/0.51  %            Number of connectives :   45 (   0   ~;   1   |;   4   &;  39   @)
% 0.21/0.51  %                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
% 0.21/0.51  %            Maximal formula depth :    6 (   2 avg)
% 0.21/0.51  %            Number of types       :    2 (   0 usr)
% 0.21/0.51  %            Number of type conns  :   43 (  43   >;   0   *;   0   +;   0  <<)
% 0.21/0.51  %            Number of symbols     :   16 (  14 usr;   5 con; 0-3 aty)
% 0.21/0.51  %            Number of variables   :   28 (  15   ^;   9   !;   4   ?;  28   :)
% 0.21/0.51  % SPC      : TH0_THM_EQU_NAR
% 0.21/0.51  
% 0.21/0.51  % Comments : 
% 0.21/0.51  %------------------------------------------------------------------------------
% 0.21/0.51  %----Include axioms for Quantales
% 0.21/0.51  %------------------------------------------------------------------------------
% 0.21/0.51  %----Usual Definition of Set Theory
% 0.21/0.51  thf(emptyset_type,type,
% 0.21/0.51      emptyset: $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(emptyset_def,definition,
% 0.21/0.51      ( emptyset
% 0.21/0.51      = ( ^ [X: $i] : $false ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(union_type,type,
% 0.21/0.51      union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(union_def,definition,
% 0.21/0.51      ( union
% 0.21/0.51      = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
% 0.21/0.51            ( ( X @ U )
% 0.21/0.51            | ( Y @ U ) ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(singleton_type,type,
% 0.21/0.51      singleton: $i > $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(singleton_def,definition,
% 0.21/0.51      ( singleton
% 0.21/0.51      = ( ^ [X: $i,U: $i] : ( U = X ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  %----Supremum Definition
% 0.21/0.51  thf(zero_type,type,
% 0.21/0.51      zero: $i ).
% 0.21/0.51  
% 0.21/0.51  thf(sup_type,type,
% 0.21/0.51      sup: ( $i > $o ) > $i ).
% 0.21/0.51  
% 0.21/0.51  thf(sup_es,axiom,
% 0.21/0.51      ( ( sup @ emptyset )
% 0.21/0.51      = zero ) ).
% 0.21/0.51  
% 0.21/0.51  thf(sup_singleset,axiom,
% 0.21/0.51      ! [X: $i] :
% 0.21/0.51        ( ( sup @ ( singleton @ X ) )
% 0.21/0.51        = X ) ).
% 0.21/0.51  
% 0.21/0.51  thf(supset_type,type,
% 0.21/0.51      supset: ( ( $i > $o ) > $o ) > $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(supset,definition,
% 0.21/0.51      ( supset
% 0.21/0.51      = ( ^ [F: ( $i > $o ) > $o,X: $i] :
% 0.21/0.51          ? [Y: $i > $o] :
% 0.21/0.51            ( ( F @ Y )
% 0.21/0.51            & ( ( sup @ Y )
% 0.21/0.51              = X ) ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(unionset_type,type,
% 0.21/0.51      unionset: ( ( $i > $o ) > $o ) > $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(unionset,definition,
% 0.21/0.51      ( unionset
% 0.21/0.51      = ( ^ [F: ( $i > $o ) > $o,X: $i] :
% 0.21/0.51          ? [Y: $i > $o] :
% 0.21/0.51            ( ( F @ Y )
% 0.21/0.51            & ( Y @ X ) ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(sup_set,axiom,
% 0.21/0.51      ! [X: ( $i > $o ) > $o] :
% 0.21/0.51        ( ( sup @ ( supset @ X ) )
% 0.21/0.51        = ( sup @ ( unionset @ X ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  %----Definition of binary sums and lattice order
% 0.21/0.51  thf(addition_type,type,
% 0.21/0.51      addition: $i > $i > $i ).
% 0.21/0.51  
% 0.21/0.51  thf(addition_def,definition,
% 0.21/0.51      ( addition
% 0.21/0.51      = ( ^ [X: $i,Y: $i] : ( sup @ ( union @ ( singleton @ X ) @ ( singleton @ Y ) ) ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(order_type,type,
% 0.21/0.51      leq: $i > $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(order_def,axiom,
% 0.21/0.51      ! [X1: $i,X2: $i] :
% 0.21/0.51        ( ( leq @ X1 @ X2 )
% 0.21/0.51      <=> ( ( addition @ X1 @ X2 )
% 0.21/0.51          = X2 ) ) ).
% 0.21/0.51  
% 0.21/0.51  %----Definition of multiplication
% 0.21/0.51  thf(multiplication_type,type,
% 0.21/0.51      multiplication: $i > $i > $i ).
% 0.21/0.51  
% 0.21/0.51  thf(crossmult_type,type,
% 0.21/0.51      crossmult: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.21/0.51  
% 0.21/0.51  thf(crossmult_def,definition,
% 0.21/0.51      ( crossmult
% 0.21/0.51      = ( ^ [X: $i > $o,Y: $i > $o,A: $i] :
% 0.21/0.51          ? [X1: $i,Y1: $i] :
% 0.21/0.51            ( ( X @ X1 )
% 0.21/0.51            & ( Y @ Y1 )
% 0.21/0.51            & ( A
% 0.21/0.51              = ( multiplication @ X1 @ Y1 ) ) ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(multiplication_def,axiom,
% 0.21/0.51      ! [X: $i > $o,Y: $i > $o] :
% 0.21/0.51        ( ( multiplication @ ( sup @ X ) @ ( sup @ Y ) )
% 0.21/0.51        = ( sup @ ( crossmult @ X @ Y ) ) ) ).
% 0.21/0.51  
% 0.21/0.51  thf(one_type,type,
% 0.21/0.51      one: $i ).
% 0.21/0.51  
% 0.21/0.51  thf(multiplication_neutral_right,axiom,
% 0.21/0.51      ! [X: $i] :
% 0.21/0.51        ( ( multiplication @ X @ one )
% 0.21/0.51        = X ) ).
% 0.21/0.51  
% 0.21/0.51  thf(multiplication_neutral_left,axiom,
% 36.82/37.09      ! [X: $i] :
% 36.82/37.09        ( ( multiplication @ one @ X )
% 36.82/37.09        = X ) ).
% 36.82/37.09  
% 36.82/37.09  %------------------------------------------------------------------------------
% 36.82/37.09  %------------------------------------------------------------------------------
% 36.82/37.09  thf(multiplication_anni,conjecture,
% 36.82/37.09      ! [X1: $i] :
% 36.82/37.09        ( ( multiplication @ zero @ X1 )
% 36.82/37.09        = zero ) ).
% 36.82/37.09  
% 36.82/37.09  %------------------------------------------------------------------------------
% 36.82/37.09  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.yhyqKGv5En/cvc5---1.0.5_19963.p...
% 36.82/37.09  (declare-sort $$unsorted 0)
% 36.82/37.09  (declare-fun tptp.emptyset ($$unsorted) Bool)
% 36.82/37.09  (assert (= tptp.emptyset (lambda ((X $$unsorted)) false)))
% 36.82/37.09  (declare-fun tptp.union ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 36.82/37.09  (assert (= tptp.union (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) (or (@ X U) (@ Y U)))))
% 36.82/37.09  (declare-fun tptp.singleton ($$unsorted $$unsorted) Bool)
% 36.82/37.09  (assert (= tptp.singleton (lambda ((X $$unsorted) (U $$unsorted)) (= U X))))
% 36.82/37.09  (declare-fun tptp.zero () $$unsorted)
% 36.82/37.09  (declare-fun tptp.sup ((-> $$unsorted Bool)) $$unsorted)
% 36.82/37.09  (assert (= (@ tptp.sup tptp.emptyset) tptp.zero))
% 36.82/37.09  (assert (forall ((X $$unsorted)) (= (@ tptp.sup (@ tptp.singleton X)) X)))
% 36.82/37.09  (declare-fun tptp.supset ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
% 36.82/37.09  (assert (= tptp.supset (lambda ((F (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ F Y) (= (@ tptp.sup Y) X))))))
% 36.82/37.09  (declare-fun tptp.unionset ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
% 36.82/37.09  (assert (= tptp.unionset (lambda ((F (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ F Y) (@ Y X))))))
% 36.82/37.09  (assert (forall ((X (-> (-> $$unsorted Bool) Bool))) (= (@ tptp.sup (@ tptp.supset X)) (@ tptp.sup (@ tptp.unionset X)))))
% 36.82/37.09  (declare-fun tptp.addition ($$unsorted $$unsorted) $$unsorted)
% 36.82/37.09  (assert (= tptp.addition (lambda ((X $$unsorted) (Y $$unsorted)) (@ tptp.sup (@ (@ tptp.union (@ tptp.singleton X)) (@ tptp.singleton Y))))))
% 36.82/37.09  (declare-fun tptp.leq ($$unsorted $$unsorted) Bool)
% 36.82/37.09  (assert (forall ((X1 $$unsorted) (X2 $$unsorted)) (= (@ (@ tptp.leq X1) X2) (= (@ (@ tptp.addition X1) X2) X2))))
% 36.82/37.09  (declare-fun tptp.multiplication ($$unsorted $$unsorted) $$unsorted)
% 36.82/37.09  (declare-fun tptp.crossmult ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 36.82/37.09  (assert (= tptp.crossmult (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (A $$unsorted)) (exists ((X1 $$unsorted) (Y1 $$unsorted)) (and (@ X X1) (@ Y Y1) (= A (@ (@ tptp.multiplication X1) Y1)))))))
% 36.82/37.09  (assert (forall ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) (= (@ (@ tptp.multiplication (@ tptp.sup X)) (@ tptp.sup Y)) (@ tptp.sup (@ (@ tptp.crossmult X) Y)))))
% 36.82/37.09  (declare-fun tptp.one () $$unsorted)
% 36.82/37.09  (assert (forall ((X $$unsorted)) (= (@ (@ tptp.multiplication X) tptp.one) X)))
% 36.82/37.09  (assert (forall ((X $$unsorted)) (= (@ (@ tptp.multiplication tptp.one) X) X)))
% 36.82/37.09  (assert (not (forall ((X1 $$unsorted)) (= (@ (@ tptp.multiplication tptp.zero) X1) tptp.zero))))
% 36.82/37.09  (set-info :filename cvc5---1.0.5_19963)
% 36.82/37.09  (check-sat-assuming ( true ))
% 36.82/37.09  ------- get file name : TPTP file name is QUA006^1
% 36.82/37.09  ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_19963.smt2...
% 36.82/37.09  --- Run --ho-elim --full-saturate-quant at 10...
% 36.82/37.09  --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 36.82/37.09  --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 36.82/37.09  --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 36.82/37.09  --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 36.82/37.09  --- Run --no-ho-matching --full-saturate-quant --enum-inst-interleave --ho-elim-store-ax at 10...
% 36.82/37.09  % SZS status Theorem for QUA006^1
% 36.82/37.09  % SZS output start Proof for QUA006^1
% 36.82/37.09  (
% 36.82/37.09  (let ((_let_1 (not (forall ((X1 $$unsorted)) (= (@ (@ tptp.multiplication tptp.zero) X1) tptp.zero))))) (let ((_let_2 (forall ((X $$unsorted)) (= (@ (@ tptp.multiplication X) tptp.one) X)))) (let ((_let_3 (forall ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) (= (@ (@ tptp.multiplication (@ tptp.sup X)) (@ tptp.sup Y)) (@ tptp.sup (@ (@ tptp.crossmult X) Y)))))) (let ((_let_4 (= tptp.crossmult (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (A $$unsorted)) (exists ((X1 $$unsorted) (Y1 $$unsorted)) (and (@ X X1) (@ Y Y1) (= A (@ (@ tptp.multiplication X1) Y1)))))))) (let ((_let_5 (= tptp.addition (lambda ((X $$unsorted) (Y $$unsorted)) (@ tptp.sup (@ (@ tptp.union (@ tptp.singleton X)) (@ tptp.singleton Y))))))) (let ((_let_6 (= tptp.unionset (lambda ((F (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ F Y) (@ Y X))))))) (let ((_let_7 (= tptp.supset (lambda ((F (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ F Y) (= (@ tptp.sup Y) X))))))) (let ((_let_8 (forall ((X $$unsorted)) (= (@ tptp.sup (@ tptp.singleton X)) X)))) (let ((_let_9 (@ tptp.sup tptp.emptyset))) (let ((_let_10 (= _let_9 tptp.zero))) (let ((_let_11 (= tptp.singleton (lambda ((X $$unsorted) (U $$unsorted)) (= U X))))) (let ((_let_12 (= tptp.union (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) (or (@ X U) (@ Y U)))))) (let ((_let_13 (= tptp.emptyset (lambda ((X $$unsorted)) false)))) (let ((_let_14 (tptp.sup lambdaF_3))) (let ((_let_15 (tptp.multiplication _let_14 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_16 (= _let_14 _let_15))) (let ((_let_17 (tptp.multiplication _let_14 tptp.one))) (let ((_let_18 (= _let_14 _let_17))) (let ((_let_19 (tptp.sup lambdaF_10))) (let ((_let_20 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 _let_19))) (let ((_let_21 (tptp.multiplication _let_14 _let_19))) (let ((_let_22 (tptp.sup lambdaF_144))) (let ((_let_23 (= _let_22 _let_21))) (let ((_let_24 (= _let_14 k_176))) (let ((_let_25 (= lambdaF_3 lambdaF_144))) (let ((_let_26 (forall ((X1 $$unsorted)) (let ((_let_1 (@ tptp.sup (lambda ((BOUND_VARIABLE_1391 $$unsorted)) false)))) (= _let_1 (@ (@ tptp.multiplication _let_1) X1)))))) (let ((_let_27 (not _let_16))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_13)) (MACRO_SR_EQ_INTRO :args (_let_13 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_29 (ASSUME :args (_let_12)))) (let ((_let_30 (EQ_RESOLVE (ASSUME :args (_let_11)) (MACRO_SR_EQ_INTRO :args (_let_11 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_31 (EQ_RESOLVE (SYMM (ASSUME :args (_let_10))) (MACRO_SR_EQ_INTRO (AND_INTRO _let_30 _let_29 _let_28) :args ((= tptp.zero _let_9) SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_32 (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_33 (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_34 (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))) (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_33 _let_32 _let_31 _let_30 _let_29 _let_28) :args (_let_5 SB_DEFAULT SBA_FIXPOINT))) _let_33 _let_32 _let_31 _let_30 _let_29 _let_28))) (let ((_let_35 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (MACRO_SR_EQ_INTRO _let_34 :args ((not (forall ((X1 $$unsorted)) (= tptp.zero (@ (@ tptp.multiplication tptp.zero) X1)))) SB_DEFAULT SBA_FIXPOINT)))))) (let ((_let_36 (or))) (let ((_let_37 (_let_27))) (let ((_let_38 (not _let_26))) (let ((_let_39 (=>))) (let ((_let_40 (not))) (let ((_let_41 (=))) (let ((_let_42 (@ tptp.multiplication _let_14))) (let ((_let_43 (@))) (let ((_let_44 (REFL :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)))) (let ((_let_45 (THEORY_PREPROCESS :args ((= (@ tptp.sup lambdaF_3) _let_14))))) (let ((_let_46 (REFL :args (tptp.sup)))) (let ((_let_47 (TRANS (CONG _let_46 (MACRO_SR_PRED_INTRO :args ((= (lambda ((BOUND_VARIABLE_1391 $$unsorted)) false) lambdaF_3))) :args _let_43) _let_45))) (let ((_let_48 (REFL :args (tptp.multiplication)))) (let ((_let_49 (_let_38))) (let ((_let_50 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_35) :args _let_49) (CONG (REFL :args _let_49) (CONG (CONG _let_47 (TRANS (CONG (CONG _let_48 _let_47 :args _let_43) _let_44 :args _let_43) (THEORY_PREPROCESS :args ((= (@ _let_42 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2) _let_15)))) :args _let_41) :args _let_40) :args _let_39))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_38) _let_26))) (REFL :args _let_37) :args _let_36)) _let_35 :args (_let_27 true _let_26)))) (let ((_let_51 (forall ((X $$unsorted)) (= X (@ (@ tptp.multiplication X) tptp.one))))) (let ((_let_52 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_53 (REFL :args (_let_14)))) (let ((_let_54 (_let_51))) (let ((_let_55 (forall ((X $$unsorted)) (= X (@ tptp.sup (lambda ((U $$unsorted)) (= U X))))))) (let ((_let_56 (EQ_RESOLVE (ASSUME :args (_let_8)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_31 _let_30 _let_29 _let_28) :args ((forall ((X $$unsorted)) (= X (@ tptp.sup (@ tptp.singleton X)))) SB_DEFAULT SBA_FIXPOINT)))))) (let ((_let_57 (THEORY_PREPROCESS :args ((= (@ tptp.sup lambdaF_10) _let_19))))) (let ((_let_58 (_let_55))) (let ((_let_59 (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_ENUM))) (let ((_let_60 (forall ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) (= (@ (@ tptp.multiplication (@ tptp.sup X)) (@ tptp.sup Y)) (@ tptp.sup (lambda ((A $$unsorted)) (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ X X1)) (not (@ Y Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1)))))))))))) (let ((_let_61 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO _let_34 :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_62 (CONG _let_48 _let_45 :args _let_43))) (let ((_let_63 (_let_60))) (let ((_let_64 (REFL :args _let_63))) (let ((_let_65 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 k_176))) (let ((_let_66 (or _let_65 _let_24))) (let ((_let_67 (lambdaF_143 k_176))) (let ((_let_68 (= _let_67 _let_66))) (let ((_let_69 (forall ((U $$unsorted)) (= (or (= U SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2) (= U (tptp.sup lambdaF_3))) (lambdaF_143 U))))) (let ((_let_70 ((forall ((U $$unsorted)) (= (lambdaF_143 U) (@ (lambda ((U $$unsorted)) (or (= U SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2) (= U (tptp.sup lambdaF_3)))) U)))))) (let ((_let_71 (EQ_RESOLVE (MACRO_SR_PRED_INTRO :args _let_70) (REWRITE :args _let_70)))) (let ((_let_72 (_let_69))) (let ((_let_73 (k_176 QUANTIFIERS_INST_CBQI_PROP))) (let ((_let_74 (lambdaF_10 k_176))) (let ((_let_75 (= _let_74 _let_67))) (let ((_let_76 (= lambdaF_10 lambdaF_143))) (let ((_let_77 (not _let_75))) (let ((_let_78 (lambdaF_10 _let_14))) (let ((_let_79 (lambdaF_143 _let_14))) (let ((_let_80 (not _let_76))) (let ((_let_81 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 _let_14))) (let ((_let_82 (= _let_81 _let_78))) (let ((_let_83 (not _let_78))) (let ((_let_84 (forall ((U $$unsorted)) (= (= U SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2) (lambdaF_10 U))))) (let ((_let_85 ((forall ((U $$unsorted)) (= (lambdaF_10 U) (@ (lambda ((U $$unsorted)) (= U SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)) U)))))) (let ((_let_86 (EQ_RESOLVE (MACRO_SR_PRED_INTRO :args _let_85) (REWRITE :args _let_85)))) (let ((_let_87 (_let_84))) (let ((_let_88 (_let_14 QUANTIFIERS_INST_ENUM))) (let ((_let_89 (tptp.multiplication _let_14 _let_14))) (let ((_let_90 (tptp.sup lambdaF_14))) (let ((_let_91 (= _let_90 _let_89))) (let ((_let_92 (= lambdaF_3 lambdaF_14))) (let ((_let_93 (not _let_81))) (let ((_let_94 (lambdaF_14 k_22))) (let ((_let_95 (lambdaF_3 k_22))) (let ((_let_96 (= _let_95 _let_94))) (let ((_let_97 (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_3 Y1)) (not (= (@ (@ tptp.multiplication X1) Y1) k_22)))))) (let ((_let_98 (not _let_97))) (let ((_let_99 (= _let_94 _let_98))) (let ((_let_100 (not _let_94))) (let ((_let_101 (forall ((A $$unsorted)) (= (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_3 Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1)))))) (lambdaF_14 A))))) (let ((_let_102 ((forall ((A $$unsorted)) (= (lambdaF_14 A) (@ (lambda ((A $$unsorted)) (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_3 Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1))))))) A)))))) (let ((_let_103 (EQ_RESOLVE (MACRO_SR_PRED_INTRO :args _let_102) (REWRITE :args _let_102)))) (let ((_let_104 (tptp.multiplication SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_37 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_38))) (let ((_let_105 (lambdaF_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_38))) (let ((_let_106 (lambdaF_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_37))) (let ((_let_107 (not _let_106))) (let ((_let_108 (or _let_107 (not _let_105) (not (= k_22 _let_104))))) (let ((_let_109 (forall ((BOUND_VARIABLE_1391 $$unsorted)) (not (lambdaF_3 BOUND_VARIABLE_1391))))) (let ((_let_110 ((forall ((BOUND_VARIABLE_1391 $$unsorted)) (= (lambdaF_3 BOUND_VARIABLE_1391) (@ (lambda ((BOUND_VARIABLE_1391 $$unsorted)) false) BOUND_VARIABLE_1391)))))) (let ((_let_111 (EQ_RESOLVE (MACRO_SR_PRED_INTRO :args _let_110) (REWRITE :args _let_110)))) (let ((_let_112 (_let_109))) (let ((_let_113 (@ (@ tptp.multiplication SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_37) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_38))) (let ((_let_114 (@ lambdaF_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_38))) (let ((_let_115 (@ lambdaF_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_37))) (let ((_let_116 (_let_98))) (let ((_let_117 (and _let_91 _let_92 _let_81))) (let ((_let_118 (APPLY_UF tptp.multiplication))) (let ((_let_119 (ASSUME :args (_let_81)))) (let ((_let_120 (ASSUME :args (_let_91)))) (let ((_let_121 (APPLY_UF tptp.sup))) (let ((_let_122 (ASSUME :args (_let_92)))) (let ((_let_123 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_71 :args _let_88) :args _let_72))) _let_71 :args (_let_79 false _let_69)))) (let ((_let_124 (ASSUME :args (_let_83)))) (let ((_let_125 (ASSUME :args (_let_76)))) (let ((_let_126 (MACRO_RESOLUTION_TRUST (THEORY_LEMMA :args ((or _let_76 _let_77) THEORY_UF)) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_124 _let_125 _let_123) :args (_let_83 _let_79 _let_76)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (TRUE_INTRO _let_123)) (HO_CONG (SYMM _let_125) _let_53) (FALSE_INTRO _let_124))) :args (_let_83 _let_76 _let_79)) :args ((not (and _let_83 _let_79 _let_76)) SB_LITERAL))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_83) _let_78))) (REFL :args ((not _let_79))) (REFL :args (_let_80)) :args _let_36)) _let_123 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_82)) :args ((or _let_81 _let_83 (not _let_82)))) (MACRO_RESOLUTION_TRUST (REORDERING (RESOLUTION (CNF_AND_NEG :args (_let_117)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_119 _let_120 _let_122) (SCOPE (TRANS (CONG (SYMM (SYMM _let_122)) :args _let_121) (SYMM (SYMM _let_120)) (CONG _let_53 (SYMM _let_119) :args _let_118)) :args (_let_81 _let_91 _let_92))) :args (_let_91 _let_92 _let_81))) :args (true _let_117)) :args ((or _let_16 (not _let_91) (not _let_92) _let_93))) (MACRO_RESOLUTION_TRUST (THEORY_LEMMA :args ((or _let_92 (not _let_96)) THEORY_UF)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_NEG1 :args (_let_96)) :args ((or _let_95 _let_94 _let_96))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_111 :args (k_22 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_112)) _let_111 :args ((not _let_95) false _let_109)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_99)) :args ((or _let_100 _let_98 (not _let_99)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE (ASSUME :args _let_116)) :args _let_116) (TRANS (REWRITE :args ((=> _let_98 (not (or (not _let_115) (not _let_114) (not (= _let_113 k_22))))))) (CONG (REFL :args _let_116) (CONG (CONG (CONG (THEORY_PREPROCESS :args ((= _let_115 _let_106))) :args _let_40) (CONG (THEORY_PREPROCESS :args ((= _let_114 _let_105))) :args _let_40) (CONG (CONG (REFL :args (k_22)) (THEORY_PREPROCESS :args ((= _let_113 _let_104))) :args _let_41) :args _let_40) :args _let_36) :args _let_40) :args _let_39)))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_98) _let_97))) (REFL :args ((not _let_108))) :args _let_36)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_108 0)) (CONG (REFL :args (_let_108)) (MACRO_SR_PRED_INTRO :args ((= (not _let_107) _let_106))) :args _let_36)) :args ((or _let_106 _let_108))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_111 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_37 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_112)) _let_111 :args (_let_107 false _let_109)) :args (_let_108 true _let_106)) :args (_let_97 false _let_108)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_103 :args (k_22 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((lambdaF_14 A)))) :args (_let_101)))) _let_103 :args (_let_99 false _let_101)) :args (_let_100 false _let_97 false _let_99)) :args (_let_96 true _let_95 true _let_94)) :args (_let_92 false _let_96)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_61 :args (lambdaF_3 lambdaF_3 QUANTIFIERS_INST_ENUM)) :args _let_63) (CONG _let_64 (TRANS (CONG (TRANS (CONG _let_62 _let_45 :args _let_43) (THEORY_PREPROCESS :args ((= (@ _let_42 _let_14) _let_89)))) (TRANS (CONG _let_46 (MACRO_SR_PRED_INTRO :args ((= (lambda ((A $$unsorted)) (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_3 Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1))))))) lambdaF_14))) :args _let_43) (THEORY_PREPROCESS :args ((= (@ tptp.sup lambdaF_14) _let_90)))) :args _let_41) (REWRITE :args ((= _let_89 _let_90)))) :args _let_39))) _let_61 :args (_let_91 false _let_60)) _let_50 :args (_let_93 false _let_92 false _let_91 true _let_16)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_86 :args _let_88) :args _let_87))) _let_86 :args (_let_82 false _let_84)) :args (_let_83 true _let_81 false _let_82)) :args (_let_80 false _let_79 true _let_78)) :args (_let_77 true _let_76)))) (let ((_let_127 (= _let_74 _let_65))) (let ((_let_128 (lambdaF_143 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_129 (not _let_74))) (let ((_let_130 (_let_75))) (let ((_let_131 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_86 :args _let_73) :args _let_87))) _let_86 :args (_let_127 false _let_84)))) (let ((_let_132 (not _let_127))) (let ((_let_133 (_let_127))) (let ((_let_134 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_71 :args _let_59) :args _let_72))) _let_71 :args (_let_128 false _let_69)))) (let ((_let_135 (not _let_65))) (let ((_let_136 (not _let_67))) (let ((_let_137 (ASSUME :args (_let_65)))) (let ((_let_138 (ASSUME :args (_let_136)))) (let ((_let_139 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_134 _let_137 _let_138) :args (_let_128 _let_136 _let_65)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_138)) (CONG (SYMM _let_137) :args (APPLY_UF lambdaF_143)) (TRUE_INTRO _let_134))) :args (_let_128 _let_65 _let_136)) :args ((not (and _let_128 _let_136 _let_65)) SB_LITERAL))) (CONG (REFL :args ((not _let_128))) (MACRO_SR_PRED_INTRO :args ((= (not _let_136) _let_67))) (REFL :args (_let_135)) :args _let_36)) _let_134 (REORDERING (CNF_EQUIV_POS1 :args _let_133) :args ((or _let_129 _let_65 _let_132))) _let_131 (CNF_EQUIV_NEG2 :args _let_130) _let_126 :args (_let_129 false _let_128 false _let_65 false _let_127 true _let_67 true _let_75)))) (let ((_let_140 (lambdaF_144 k_167))) (let ((_let_141 (lambdaF_3 k_167))) (let ((_let_142 (= _let_141 _let_140))) (let ((_let_143 (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_10 Y1)) (not (= (@ (@ tptp.multiplication X1) Y1) k_167)))))) (let ((_let_144 (not _let_143))) (let ((_let_145 (= _let_140 _let_144))) (let ((_let_146 (not _let_140))) (let ((_let_147 (forall ((A $$unsorted)) (= (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_10 Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1)))))) (lambdaF_144 A))))) (let ((_let_148 ((forall ((A $$unsorted)) (= (lambdaF_144 A) (@ (lambda ((A $$unsorted)) (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_10 Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1))))))) A)))))) (let ((_let_149 (EQ_RESOLVE (MACRO_SR_PRED_INTRO :args _let_148) (REWRITE :args _let_148)))) (let ((_let_150 (tptp.multiplication SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_190 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_191))) (let ((_let_151 (lambdaF_10 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_191))) (let ((_let_152 (lambdaF_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_190))) (let ((_let_153 (not _let_152))) (let ((_let_154 (or _let_153 (not _let_151) (not (= k_167 _let_150))))) (let ((_let_155 (@ (@ tptp.multiplication SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_190) SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_191))) (let ((_let_156 (@ lambdaF_10 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_191))) (let ((_let_157 (@ lambdaF_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_190))) (let ((_let_158 (_let_144))) (let ((_let_159 (= _let_15 k_176))) (let ((_let_160 (ASSUME :args (_let_18)))) (let ((_let_161 (SYMM (SYMM _let_160)))) (let ((_let_162 (ASSUME :args (_let_24)))) (let ((_let_163 (SYMM _let_162))) (let ((_let_164 (ASSUME :args _let_37))) (let ((_let_165 (ASSUME :args (_let_25)))) (let ((_let_166 (ASSUME :args (_let_23)))) (let ((_let_167 (ASSUME :args (_let_20)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_160 _let_162 (MODUS_PONENS (AND_INTRO _let_162 _let_165 _let_166 _let_167) (SCOPE (TRANS (CONG _let_53 (SYMM (SYMM _let_167)) :args _let_118) (SYMM _let_166) (CONG (SYMM _let_165) :args _let_121) (SYMM _let_163)) :args (_let_24 _let_25 _let_23 _let_20))) _let_164) :args (_let_27 _let_18 _let_20 _let_23 _let_25 _let_24)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_164)) (TRUE_INTRO (TRANS _let_161 (SYMM (TRANS (SYMM (SYMM (ASSUME :args (_let_159)))) _let_163 _let_161)))))) :args (_let_18 _let_24 _let_159 _let_27)) :args ((not (and _let_27 _let_18 _let_20 _let_23 _let_25 _let_24)) SB_LITERAL))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_27) _let_16))) (REFL :args ((not _let_18))) (REFL :args ((not _let_20))) (REFL :args ((not _let_23))) (REFL :args ((not _let_25))) (REFL :args ((not _let_24))) :args _let_36)) (MACRO_RESOLUTION_TRUST (THEORY_LEMMA :args ((or _let_25 (not _let_142)) THEORY_UF)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_NEG1 :args (_let_142)) :args ((or _let_141 _let_140 _let_142))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_111 :args (k_167 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_112)) _let_111 :args ((not _let_141) false _let_109)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_145)) :args ((or _let_146 _let_144 (not _let_145)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE (ASSUME :args _let_158)) :args _let_158) (TRANS (REWRITE :args ((=> _let_144 (not (or (not _let_157) (not _let_156) (not (= _let_155 k_167))))))) (CONG (REFL :args _let_158) (CONG (CONG (CONG (THEORY_PREPROCESS :args ((= _let_157 _let_152))) :args _let_40) (CONG (THEORY_PREPROCESS :args ((= _let_156 _let_151))) :args _let_40) (CONG (CONG (REFL :args (k_167)) (THEORY_PREPROCESS :args ((= _let_155 _let_150))) :args _let_41) :args _let_40) :args _let_36) :args _let_40) :args _let_39)))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_144) _let_143))) (REFL :args ((not _let_154))) :args _let_36)) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_154 0)) (CONG (REFL :args (_let_154)) (MACRO_SR_PRED_INTRO :args ((= (not _let_153) _let_152))) :args _let_36)) :args ((or _let_152 _let_154))) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_111 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_190 QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_112)) _let_111 :args (_let_153 false _let_109)) :args (_let_154 true _let_152)) :args (_let_143 false _let_154)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_149 :args (k_167 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((lambdaF_144 A)))) :args (_let_147)))) _let_149 :args (_let_145 false _let_147)) :args (_let_146 false _let_143 false _let_145)) :args (_let_142 true _let_141 true _let_140)) :args (_let_25 false _let_142)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_66)) :args ((or _let_65 _let_24 (not _let_66)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args _let_133) :args ((or _let_74 _let_135 _let_132))) _let_139 _let_131 :args (_let_135 true _let_74 false _let_127)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_68)) :args ((or _let_136 _let_66 (not _let_68)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_NEG1 :args _let_130) :args ((or _let_74 _let_67 _let_75))) _let_139 _let_126 :args (_let_67 true _let_74 true _let_75)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_71 :args _let_73) :args _let_72))) _let_71 :args (_let_68 false _let_69)) :args (_let_66 false _let_67 false _let_68)) :args (_let_24 true _let_65 false _let_66)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_61 :args (lambdaF_3 lambdaF_10 QUANTIFIERS_INST_ENUM)) :args _let_63) (CONG _let_64 (TRANS (CONG (TRANS (CONG _let_62 _let_57 :args _let_43) (THEORY_PREPROCESS :args ((= (@ _let_42 _let_19) _let_21)))) (TRANS (CONG _let_46 (MACRO_SR_PRED_INTRO :args ((= (lambda ((A $$unsorted)) (not (forall ((X1 $$unsorted) (Y1 $$unsorted)) (or (not (@ lambdaF_3 X1)) (not (@ lambdaF_10 Y1)) (not (= A (@ (@ tptp.multiplication X1) Y1))))))) lambdaF_144))) :args _let_43) (THEORY_PREPROCESS :args ((= (@ tptp.sup lambdaF_144) _let_22)))) :args _let_41) (REWRITE :args ((= _let_21 _let_22)))) :args _let_39))) _let_61 :args (_let_23 false _let_60)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_56 :args _let_59) :args _let_58) (CONG (REFL :args _let_58) (CONG _let_44 (TRANS (CONG _let_46 (MACRO_SR_PRED_INTRO :args ((= (lambda ((U $$unsorted)) (= U SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)) lambdaF_10))) :args _let_43) _let_57) :args _let_41) :args _let_39))) _let_56 :args (_let_20 false _let_55)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_52 :args (_let_14 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((@ tptp.multiplication X)))) :args _let_54) (CONG (REFL :args _let_54) (CONG _let_53 (THEORY_PREPROCESS :args ((= (@ _let_42 tptp.one) _let_17))) :args _let_41) :args _let_39))) _let_52 :args (_let_18 false _let_51)) _let_50 :args (false false _let_25 false _let_24 false _let_23 false _let_20 false _let_18 true _let_16)) :args (_let_13 _let_12 _let_11 _let_10 _let_8 _let_7 _let_6 (forall ((X (-> (-> $$unsorted Bool) Bool))) (= (@ tptp.sup (@ tptp.supset X)) (@ tptp.sup (@ tptp.unionset X)))) _let_5 (forall ((X1 $$unsorted) (X2 $$unsorted)) (= (@ (@ tptp.leq X1) X2) (= (@ (@ tptp.addition X1) X2) X2))) _let_4 _let_3 _let_2 (forall ((X $$unsorted)) (= (@ (@ tptp.multiplication tptp.one) X) X)) _let_1 true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 36.82/37.09  )
% 36.82/37.09  % SZS output end Proof for QUA006^1
% 36.82/37.09  % cvc5---1.0.5 exiting
% 36.82/37.09  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------